COMPUTATIONAL ASPECTS OF BULK-SERVICE QUEUEING SYSTEM WITH VARIABLE CAPACITY AND FINITE WAITING SPACE: M/GY /l/N+B
نویسنده
چکیده
In this paper, a comparative analysis of the computational aspects of a bulk-service queueing system with variable capacity and finite waiting space is carried out using the Jacobi method of iteration and the rootfinding method. Steady-state probabilities and moments of the number of customers in system at post-departure epochs have been obtained. In the special case when service is performed in batches of fixed size B, a set of relations among post-departure, random and pre-arrival epochs probabilities has also been obtained. For this special case, we present various performance measures such as moments of number in system at random epoch, probability of blocking, probability that server is busy, etcetera. A variety of numerical results have been obtained for several service-time distributions: Erlang, deterministic and hyperexponential. It was finally observed that the Jacobi method is less cumbersome than the rootfinding method.
منابع مشابه
On Discrete - Time Single - Server Queues with Markov Modulated Batch Bernoulli Input and Finite Capacity
This paper investigates a discrete-time system with Markov modulated batch Bernoulli process (MMBP) inputs, general service times, and a finite capacity waiting room (queue). The FIFa and space priority service rules are considered. The main motivation for studying this type of queue is its potential applicability to time-slotted communication systems in broadband ISDN (B-ISDN). Applying the su...
متن کاملA Approximations in Finite Capacity /? Multi-server Queues with Poisson Arrivals
In (his paper^-we^consider;an M/G/k queuelng model having finite capacity N . That Is, a model In which customers, arriving In accordance with a Polsson process having rate ■h > , enter the system If there are less than N others present when they arrive, and are then serviced by one of k servers, each of whom has service distribution G . Upon entering, a customer will either Immediately enter s...
متن کاملLimits for Queues as the Waiting Room Grows
We study the convergence of finite-capacity open queueing systems to their infinite-capacity counterparts as the capacity increases. Convergence of the transient behavior is easily established in great generality provided that the finite-capacity system can be identified with the infinitecapacity system up to the first time that the capacity is exceeded. Convergence of steady-state distribution...
متن کاملFinite Capacity Queuing System with Vacations and Server Breakdowns
This paper deals with finite capacity single server queuing system with vacations. Vacation starts at rate nu if the system is empty. Also the server takes another vacation if upon his arrival to the system, finds the system empty. Customers arrive in the system in Poisson fashion at rate lamda0 during vacation, faster rate lamdaf during active service and slower rate lamdas during the breakdow...
متن کاملM M m K Queue With Additional Servers and Discouragement (RESEARCH NOTE)
Waiting in long queue is undesirable due to which in some practical situations customers become impatient and leave the system. In such cases providing additional servers can reduce long queue. This investigation deals with multi-server queueing system with additional servers and discouragement. The customers arrive in poisson fashion and are served exponentially by a pool of permanent and addi...
متن کامل